One – generator quasi – abelian codes revisited ∗
نویسندگان
چکیده
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl’s online table are presented. 2010 MSC: 94B15, 94B60, 16A26
منابع مشابه
Hermitian self-dual quasi-abelian codes
Quasi-abelian codes constitute an important class of linear codes containing theoretically and practically interesting codes such as quasi-cyclic codes, abelian codes, and cyclic codes. In particular, the sub-class consisting of 1-generator quasi-abelian codes contains large families of good codes. Based on the well-known decomposition of quasi-abelian codes, the characterization and enumeratio...
متن کاملCodes Closed under Arbitrary Abelian Group of Permutations
Algebraic structure of codes over Fq , closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasicyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special case...
متن کاملOne generator $(1+u)$-quasi twisted codes over $F_2+uF_2$
This paper gives the minimum generating sets of three types of one generator (1 + u)-quasi twisted (QT) codes over F 2 + uF 2 , u 2 = 0. Moreover, it discusses the generating sets and the lower bounds on the minimum Lee distance of a special class of A 2 type one generator (1 + u)-QT codes. Some good (optimal or suboptimal) linear codes over F 2 are obtained by these types of one generator (1 +...
متن کاملQuasi-Cyclic Codes Over Finite Chain Rings
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we investigate the structural properties of 1-generator QC codes. Under some conditions, we discuss the enumeration of 1-generator QC codes and describe how to o...
متن کاملOne generator quasi-cyclic codes over F2 + uF2 + vF2 + uvF2
In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 +uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we also investigate the structure of 1-generator generalized quasi-cyclic codes over R and determine a BCH type bound for them.
متن کامل